The first axiomatization of relevant logic
نویسنده
چکیده
This is a review. with historical and critical comments, of a paper b) I. E. Orlov from 1928, which eivcs the oldest known axiomatization of the implicationnegation fragment of the rclcvant logic R. Orlov’s paper also l’omshadow the modal translation of systems with an intuitionistic negation into %-type extensions of systems with a classical. involutive. negation. Orlov introduces the modal postulates of S4 before Becker. Lewis and Giidcl. Orlov’s work. which seems to bc nearly completely ignored, is related to the contemporaneous work on the axiomatization of intuitionistic logic. In (1928) I. E. Orlov gave an axiomatization of the implicationnegation fragment of the relevcnzt loyic R. and this may well be the very first axiomatization of relevant logic. It is perhaps not fortuitous that the first axiomatization of relevant logic should appear at the same time when the first axiomatizations of intuition&tic logic were being produced. This is not the only achievement of Orlov’s paper. He also foreshadows the ~nodul tratdation of systems with an intuitionistic negation into S4-type extensions of systems with a classical, involutive, negation. By “modal translation“ we mean a translation that prefixes the necessity operator to subformulae of a nonmodal formula. That there is such a modal translation from Heyting’s logic into the modal logic S4, which is based on classical logic, has been claimed by Godcl (1933): and has become a very well known fact about Heyting’s logic. In my paper (1992), it is shown that there are analogous modal translations from intuitionistic variants of linear logic, relevant logic and BCK logic into S4-type extensions of the respective systems with a negation like classical negation. Metaphorically speaking, the S4 necessity operator subdues classical negation and transforms it into an intuitionistic one. Such a modal translation for relevant logic is only foreshadowed in Orlov’s paper. But he introduces quite explicitly the characteristic modal postulates of S4, in the form they have in Journal of I~hilosophical Logic 21: 339-356. 1992. CI 1992 Kluwer Academic Yuhli.shars. Prinkd in the ~Ve~herlantls.
منابع مشابه
An Axiomatization of a First-order Branching Time Temporal Logic
We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic.
متن کاملSquares in Fork Arrow Logic
In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema’s non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork o...
متن کاملAxiomatization of Typed First-Order Logic
This paper contributes to the theory of typed first-order logic. We present a sound and complete axiomatization for a basic typed logic lifting restrictions imposed by previous results. As a second contribution, this paper provides complete axiomatizations for the type predicates instanceT , exactInstanceT , and functions castT indispensable for reasoning about object-oriented programming langu...
متن کاملAndersonian Deontic Logic, Propositional Quantification, and Mally
We present a new axiomatization of the deontic fragment of Anderson’s relevant deontic logic, give an Andersonian reduction of a relevant version of Mally’s deontic logic previously discussed in this journal, study the effect of adding propositional quantification to Anderson’s system, and discuss the meaning of Anderson’s propositional constant in a wide range of Andersonian deontic systems.
متن کاملFirst-Order Logic with Dependent Types
We present DFOL, an extension of classical first-order logic with dependent types, i.e., as in Martin-Löf type theory, signatures may contain type-valued function symbols. A model theory for the logic is given that stays close to the established first-order model theory. The logic is presented as an institution, and the logical framework LF is used to define signatures, terms and formulas. We s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Philosophical Logic
دوره 21 شماره
صفحات -
تاریخ انتشار 1992